Budget Feasible Mechanisms for Experimental Design

In the classical experimental design setting, an experimenter E has access to a population of $n$ potential experiment subjects $i\in \{1,...,n\}$, each associated with a vector of features $x_i\in R^d$. Conducting an experiment with subject $i$ reveals an unknown value $y_i\in R$ to E. E typically assumes some hypothetical relationship between $x_i$'s and $y_i$'s, e.g., $y_i \approx \beta x_i$, and estimates $\beta$ from experiments, e.g., through linear regression. As a proxy for various practical constraints, E may select only a subset of subjects on which to conduct the experiment. We initiate the study of budgeted mechanisms for experimental design. In this setting, E has a budget $B$. Each subject $i$ declares an associated cost $c_i >0$ to be part of the experiment, and must be paid at least her cost. In particular, the Experimental Design Problem (EDP) is to find a set $S$ of subjects for the experiment that maximizes V(S) = \log\det(I_d+\sum_{i\in S}x_i\T{x_i}) under the constraint $\sum_{i\in S}c_i\leq B$; our objective function corresponds to the information gain in parameter $\beta$ that is learned through linear regression methods, and is related to the so-called $D$-optimality criterion. Further, the subjects are strategic and may lie about their costs. We present a deterministic, polynomial time, budget feasible mechanism scheme, that is approximately truthful and yields a constant factor approximation to EDP. In particular, for any small $\delta > 0$ and $\epsilon > 0$, we can construct a (12.98, $\epsilon$)-approximate mechanism that is $\delta$-truthful and runs in polynomial time in both $n$ and $\log\log\frac{B}{\epsilon\delta}$. We also establish that no truthful, budget-feasible algorithms is possible within a factor 2 approximation, and show how to generalize our approach to a wide class of learning problems, beyond linear regression

Online Maximum k-Coverage

We study an online model for the maximum k-vertex-coverage problem, where given a graph G = (V,E) and an integer k, we ask for a subset A ⊆ V, such that |A | = k and the number of edges covered by A is maximized. In our model, at each step i, a new vertex vi is revealed, and we have to decide whether we will keep it or discard it. At any time of the process, only k vertices can be kept in memory; if at some point the current solution already contains k vertices, any inclusion of any new vertex in the solution must entail the irremediable deletion of one vertex of the current solution (a vertex not kept when revealed is irremediably deleted). We propose algorithms for several natural classes of graphs (mainly regular and bipartite), improving on an easy 1/2-competitive ratio. We next settle a set-version of the problem, called maximum k-(set)-coverage problem. For this problem we present an algorithm that improves upon former results for the same model for small and moderate values of k

Open block scheduling in optical communication networks

AbstractIn this paper the process of data transmission in star coupled optical communication networks is modelled as a shop-type scheduling problem, where channels (wavelengths) are treated as machines. We formulate an Open Block problem with the minimum makespan objective (OB||Cmax) in which a relation of a new type between the operations of each job is introduced: any two operations of a job have identical processing times and may be processed either simultaneously (in a common block) or, alternatively, at disjoint time intervals. We show that the problem is polynomially solvable for 4 machines, NP-hard for 6 machines and strongly NP-hard for a variable number of machines. For the case of a variable number of machines we present a polynomial time 2-approximation algorithm and prove that there is no polynomial time ρ-approximation algorithm with ρ<11/10, unless P=NP. For the case when the number of machines is fixed, we show that the problem admits a linear time PTAS. In addition, we show that the two-machine problem with release dates is NP-hard in the strong sense

A new measurement of the Collins and Sivers asymmetries on a transversely polarised deuteron target

New high precision measurements of the Collins and Sivers asymmetries of charged hadrons produced in deep-inelastic scattering of muons on a transversely polarised 6LiD target are presented. The data were taken in 2003 and 2004 with the COMPASS spectrometer using the muon beam of the CERN SPS at 160 GeV/c. Both the Collins and Sivers asymmetries turn out to be compatible with zero, within the present statistical errors, which are more than a factor of 2 smaller than those of the published COMPASS results from the 2002 data. The final results from the 2002, 2003 and 2004 runs are compared with naive expectations and with existing model calculations.Comment: 40 pages, 28 figure

Gluon polarization in the nucleon from quasi-real photoproduction of high-pT hadron pairs

We present a determination of the gluon polarization Delta G/G in the nucleon, based on the helicity asymmetry of quasi-real photoproduction events, Q^2<1(GeV/c)^2, with a pair of large transverse-momentum hadrons in the final state. The data were obtained by the COMPASS experiment at CERN using a 160 GeV polarized muon beam scattered on a polarized 6-LiD target. The helicity asymmetry for the selected events is = 0.002 +- 0.019(stat.) +- 0.003(syst.). From this value, we obtain in a leading-order QCD analysis Delta G/G=0.024 +- 0.089(stat.) +- 0.057(syst.) at x_g = 0.095 and mu^2 =~ 3 (GeV}/c)^2.Comment: 10 pages, 3 figure

The Deuteron Spin-dependent Structure Function g1d and its First Moment

We present a measurement of the deuteron spin-dependent structure function g1d based on the data collected by the COMPASS experiment at CERN during the years 2002-2004. The data provide an accurate evaluation for Gamma_1^d, the first moment of g1d(x), and for the matrix element of the singlet axial current, a0. The results of QCD fits in the next to leading order (NLO) on all g1 deep inelastic scattering data are also presented. They provide two solutions with the gluon spin distribution function Delta G positive or negative, which describe the data equally well. In both cases, at Q^2 = 3 (GeV/c)^2 the first moment of Delta G is found to be of the order of 0.2 - 0.3 in absolute value.Comment: fits redone using MRST2004 instead of MRSV1998 for G(x), correlation matrix adde

Leading order determination of the gluon polarisation from DIS events with high-p_T hadron pairs

We present a determination of the gluon polarisation Delta g/g in the nucleon, based on the longitudinal double-spin asymmetry of DIS events with a pair of large transverse-momentum hadrons in the final state. The data were obtained by the COMPASS experiment at CERN using a 160 GeV/c polarised muon beam scattering off a polarised ^6LiD target. The gluon polarisation is evaluated by a Neural Network approach for three intervals of the gluon momentum fraction x_g covering the range 0.04 < x_g < 0.27. The values obtained at leading order in QCD do not show any significant dependence on x_g. Their average is Delta g/g = 0.125 +/- 0.060 (stat.) +/- 0.063 (syst.) at x_g=0.09 and a scale of mu^2 = 3 (GeV/c)^2.Comment: 13 pages, 6 figures and 3 table

Spin asymmetry A_1^d and the spin-dependent structure function g_1^d of the deuteron at low values of x and Q^2

We present a precise measurement of the deuteron longitudinal spin asymmetry A_1^d and of the deuteron spin-dependent structure function g_1^d at Q^2 < 1 GeV^2 and 4*10^-5 < x < 2.5*10^-2 based on the data collected by the COMPASS experiment at CERN during the years 2002 and 2003. The statistical precision is tenfold better than that of the previous measurement in this region. The measured A_1^d and g_1^d are found to be consistent with zero in the whole range of x.Comment: 17 pages, 10 figure

Measurement of the Spin Structure of the Deuteron in the DIS Region

We present a new measurement of the longitudinal spin asymmetry A_1^d and the spin-dependent structure function g_1^d of the deuteron in the range 1 GeV^2 < Q^2 < 100 GeV^2 and 0.004< x <0.7. The data were obtained by the COMPASS experiment at CERN using a 160 GeV polarised muon beam and a large polarised 6-LiD target. The results are in agreement with those from previous experiments and improve considerably the statistical accuracy in the region 0.004 < x < 0.03.Comment: 10 pages, 6 figures, subm. to PLB, revised: author list, Fig. 4, details adde

Experimental investigation of transverse spin asymmetries in muon-p SIDIS processes: Collins asymmetries

The COMPASS Collaboration at CERN has measured the transverse spin azimuthal asymmetry of charged hadrons produced in semi-inclusive deep inelastic scattering using a 160 GeV positive muon beam and a transversely polarised NH_3 target. The Collins asymmetry of the proton was extracted in the Bjorken x range 0.003<x<0.7. These new measurements confirm with higher accuracy previous measurements from the COMPASS and HERMES collaborations, which exhibit a definite effect in the valence quark region. The asymmetries for negative and positive hadrons are similar in magnitude and opposite in sign. They are compatible with model calculations in which the u-quark transversity is opposite in sign and somewhat larger than the d-quark transversity distribution function. The asymmetry is extracted as a function of Bjorken $x$, the relative hadron energy $z$ and the hadron transverse momentum p_T^h. The high statistics and quality of the data also allow for more detailed investigations of the dependence on the kinematic variables. These studies confirm the leading-twist nature of the Collins asymmetry.Comment: 11 pages, 5 figure